Static Allocation of Multirail Networks

نویسندگان

  • Salvador Coll
  • Eitan Frachtenberg
  • Fabrizio Petrini
  • Adolfy Hoisie
  • Leonid Gurvits
چکیده

Using multiple independent networks (also known as rails) is an emerging technique to overcome bandwidth limitations and enhance fault-tolerance of current high-performance clusters. This report presents the limitations and performance of static rail-allocation approaches, where each rail is pre-assigned a direction for communication. An analytical lower bound on the number of networks required for rail allocation is shown. We present an extensive experimental comparison of the behavior of various allocation schemes in terms of bandwidth and latency, compared to static rail allocation. We also compare the ability of static and dynamic rail-allocation mechanism to stripe messages over multiple rails. Scalability issues of static and dynamic rail allocation are also compared. We find that not only static rail allocation necessarily consumes many resources, it also performs poorly compared to dynamic rail allocation schemes, in all the tested aspects.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Building Multirail InfiniBand Clusters: MPI-Level Designs and Performance Evaluation

In the area of cluster computing, InfiniBand is becoming increasingly popular due to its open standard and high performance. However, even with InfiniBand, network bandwidth can still become the performance bottleneck for some of today’s most demanding applications. In this paper, we study the problem of how to overcome the bandwidth bottleneck by using multirail networks. We present different ...

متن کامل

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

The Role of Regulatory in Price Control and Spectrum Allocation to Competing Wireless Access Networks

With the rapid growth of wireless access networks, various providers offer their services using different technologies such as Wi-Fi, Wimax, 3G, 4G and so on. These networks compete for the scarce wireless spectrum. The spectrum is considered to be a scarce resource moderated by the spectrum allocation regulatory (“regulatory” for short) which is the governance body aiming to maximize the socia...

متن کامل

Evaluating the importance of dynamic allocation and routing of rescuers in reducing response time

Due to delay in receiving emergency medical services, a high number of injured people and patients annually lose their lives. Determining the medical service area and correct routing of rescuing operation is influential on the reduction of rescuers’ response time. Changing the traffic flow leads to change of medical service area. Therefore, it is expected that by observing changing traffic, the...

متن کامل

A New Fairness Index and Novel Approach for QoS-Aware Resource Allocation in LTE Networks Based on Utility Functions

Resource allocation techniques have recently appeared as a widely recognized feature in LTE networks. Most of existing approaches in resource allocation focus on maximizing network’s utility functions. The great potential of utility function in improving resource allocation and enhancing fairness and mean opinion score (MOS) indexes has attracted large efforts over the last few years. In this p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001